A lower bound for constant dimension codes from multi-component lifted MRD codes
نویسنده
چکیده
In this work we investigate unions of lifted MRD codes of a fixed dimension and minimum distance and derive an explicit formula for the cardinality of such codes. This will then imply a lower bound on the cardinality of constant dimension codes. We will first repeat some known results needed in this section. In Section 2 we will explain the construction and derive the formula for the cardinality and the lower bound. We conclude in Section 3. Let Fq be the finite field with q elements. Gq(k, n) denotes the set of all k-dimensional vector spaces over Fq , called the Grassmannian. A constant dimension code is simply a subset of Gq(k, n). A metric on Gq(k, n) is the injection metric, given by
منابع مشابه
Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show relations between them. A slightly improved version of the so-called linkage construction is presented which is e.g. used to construct constant dimension codes...
متن کاملParallelisms of PG ( 3 , 5 ) with automorphisms of order 13 1
A spread is a set of lines of PG(n, q), which partition the point set. A parallelism is a partition of the set of lines by spreads. Some constructions of constant dimension codes that contain lifted MRD codes are based on parallelisms of projective spaces. We construct all (321) parallelisms in PG(3, 5) with automorphisms of order 13 and find the order of their full automorphism groups.
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملProperties of Codes with the Rank Metric
In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD co...
متن کاملOn dually almost MRD codes
In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD. Dually AMRD codes are the closest to the MRD codes given that both they and their dual codes are almost optimal. Necessary and sufficient conditions for the codes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1301.1918 شماره
صفحات -
تاریخ انتشار 2013